The new science of complexity

نویسنده

  • Joseph L. McCauley
چکیده

Deterministic chaos, and even maximum computational complexity, have been discovered within Newtonian dynamics. Encouraged by comparisons of the economy with the weather, a Newtonian system, economists assume that prices and price changes can also obey abstract mathematical laws of motion. Meanwhile, sociologists and other postmodernists advertise that physics and chemistry have outgrown their former limitations, that chaos and complexity provide new holistic paradigms for science, and that the boundaries between the hard and the soft sciences, once impenetrable, have disappeared along with the Berlin Wall. Three hundred years after the deaths of Galileo, Descartes, and Kepler, and the birth of Newton, reductionism would appear to be on the decline, with holistic approaches to science on the upswing. We therefore examine the evidence that dynamical laws of motion may be discovered from empirical studies of chaotic or complex phenomena, and also review the foundations of reductionism.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Measurement of Complexity and Comprehension of a Program Through a Cognitive Approach

The inherent complexity of the software systems creates problems in the software engineering industry. Numerous techniques have been designed to comprehend the fundamental characteristics of software systems. To understand the software, it is necessary to know about the complexity level of the source code. Cognitive informatics perform an important role for better understanding the complexity o...

متن کامل

An Algorithm to Compute the Complexity of a Static Production Planning (RESEARCH NOTE)

Complexity is one of the most important issues of any production planning. The increase in complexity of production planning can cause inconsistency between a production plan and an actual outcome. The complexity generally can be divided in two categories, the static complexity and the dynamic complexity, which can be computed using the ant ropy formula. The formula considers the probability of...

متن کامل

Using Complexity to Simplify Knowledge Translation; Comment on “Using Complexity and Network Concepts to Inform Healthcare Knowledge Translation”

Putting health theories, research and knowledge into practice is a challenge referred to as the knowledge-toaction gap. Knowledge translation (KT), and its related concepts of knowledge mobilization, implementation science and research impact, emerged to mitigate this gap. While the social interaction view of KT has gained currency, scholars have not easily made a link between KT and the concep...

متن کامل

Chaos/Complexity Theory and Education

Sciences exist to demonstrate the fundamental order underlying nature. Chaos/complexity theory is a novel and amazing field of scientific inquiry. Notions of our everyday experiences are somehow in connection to the laws of nature through chaos/complexity theory’s concerns with the relationships between simplicity and complexity, between orderliness and randomness (Retrieved from http://www.inc...

متن کامل

Examine the complexity of Iran’s Petrochemical Industry and its future opportunities

This research aims to investigate technological capabilities competitiveness of Iran’s petrochemical industry products in 2016 . The main questions of the study are 1) in which petrochemical industry products does Iran enjoys a revealed comparative advantage? 2) what are the opportunities for Iran to diversify petrochemical export basket? in order to answer these questions we have used an appro...

متن کامل

An improved algorithm to reconstruct a binary tree from its inorder and postorder traversals

It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000